initial placement meaning in English
初始布局
Examples
- Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design . due to the limitation of computing complexity , an effective and efficient initial placement is very important for detailed placement . novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps . moreover , divide - and - conquer strategy and other simplified methods are adopted to minimize complexity . experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time
文摘:以大规模混合模式布局问题为背景,提出了有效的初始详细布局算法.在大规模混合模式布局问题中,由于受到计算复杂性的限制,有效的初始布局算法显得非常重要.该算法采用网络流方法来满足行容量约束,采用线性布局策略解决单元重叠问题.同时,为解决大规模设计问题,整体上采用分治策略和简化策略,有效地控制问题的规模,以时间开销的少量增加换取线长的明显改善.实验结果表明该算法能够取得比较好的效果,平均比paflo算法有16的线长改善,而cpu计算时间只有少量增加 - Abstract : a new algorithm w - ecop is presented to effect incremental changes on a standard cell layout automatically . this algorithm deals with cell inserting and cell moving based on rows instead of on cells as most placement algorithms usually do . an integer programming problem is formulated to minimize the adjustment on the initial placement and a heuristic method is presented to search for a shifting path so as to optimize the wirelength . test of w - ecop on a group of practical test cases shows that the algorithm can successfully accomplish incremental placement with good quality and high speed
文摘:提出了一种新的增量式布局方法w - ecop来满足快速调整布局方案的要求.与以前的以单元为中心的算法不同,算法基于单元行划分来进行单元的插入和位置调整,在此过程中使对原布局方案的影响最小,并且尽可能优化线长.一组从美国工业界的测试例子表明,该算法运行速度快,调整后的布局效果好 - A novel method of content - based image segmentation using deformable template matching is proposed . a two - dimensional ( 2 - d ) deformable template based on orthogonal curves is built by pre - computing extensions of the deformable template along orthogonal curves and sampling the curves uniformly . then the definitions of internal and external energy functions are given according to the image segmentation problem , and genetic algorithm is used to obtain globally optimal solutions . the proposed method uses a lower - dimensional search space than conventional methods and reduces the sensitivity of the algorithm to initial placement of the template . experiments on real - world images and in simulations at low signal - to - noise ratio show the robustness and good performance of the method
本文提出一种采用可变形模板匹配技术进行基于内容的图像分割算法.通过预先计算出可变形模板沿着变形的正交曲线，并对模板曲线及正交曲线进行离散抽样，建立一基于正交曲线的二维( 2 - d )可变形模板，针对图像分割问题定义控制可变形模板进行变形的内、外部能量函数，本文采用遗传算法搜索能量函数最小的全局最优解.该新算法比传统的可变形模板匹配方法降低了搜索空间的维数，减少了算法对模板初始位置的敏感.对实际图像及模拟低信噪比图像处理的结果表明，新算法具有良好的分割精度及稳定性